Forcing Complexity: Minimum Sizes of Forcing Conditions
نویسندگان
چکیده
منابع مشابه
Forcing Complexity: Minimum Sizes of Forcing Conditions
This note is a continuation of our former paper “Complexity of the r-query tautologies in the presence of a generic oracle” (Notre Dame J. Formal Logic 41 (2000)). We give a very short direct proof of the nonexistence of t-generic oracles, a result obtaind first by Dowd (Inform. and Comput. 96 (1992)). We also reconsitute a proof of Dowd’s result that the class of all r-generic oracles in his s...
متن کاملTight Minimum Degree Conditions Forcing Perfect Matchings in Uniform Hypergraphs
Given positive integers k and ` where k/2 ≤ ` ≤ k− 1, we give a minimum `-degree condition that ensures a perfect matching in a kuniform hypergraph. This condition is best possible and improves on work of Pikhurko [12] who gave an asymptotically exact result, and extends work of Rödl, Ruciński and Szemerédi [15] who determined the threshold for ` = k−1. Our approach makes use of the absorbing m...
متن کاملForcing with finite conditions
We present a generalisation to ω2 of Baumgartner’s forcing for adding a CUB subset of ω1 with finite conditions. The following well-known result appears in Baumgartner, Harrington, Kleinberg [2]. For the reader’s convenience we provide a proof here. Theorem 1 Suppose that X ⊆ ω1. Then the following are equivalent: a. X contains a CUB subset in an outer model which preserves ω1. b. X is stationa...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2001
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1054837938